A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem
نویسندگان
چکیده
1Pontificia Universidad Católica de Valparaı́so, 2362807 Valparaı́so, Chile 2Universidad San Sebastián, 8420524 Santiago, Chile 3Universidad Central de Chile, 8370178 Santiago, Chile 4Universidad Autónoma de Chile, 7500138 Santiago, Chile 5Universidad Cientifica del Sur, Lima 18 Lima, Peru 6Universidad de Playa Ancha, 2360003 Valparaı́so, Chile 7Escuela de Ingenieŕıa Industrial, Universidad Diego Portales, 8370109 Santiago, Chile 8Universidad Técnica Federico Santa Maŕıa, 2390123 Valparaı́so, Chile 9Facultad de Ingenieŕıa, Universidad Santo Tomás, 2561694 Viña del Mar, Chile
منابع مشابه
An Artificial Bee Colony Algorithm for the Set Covering Problem
In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique based on the intelligent foraging behavior of honey bee swarm. Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the...
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملApplication of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic techniqu...
متن کاملCat Swarm Optimization with Different Binarization Methods for Solving Set Covering Problems
In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behaviour of discrete cats. Domestic cats sh...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کامل